A Reliable Fault-Tolerant Scheduling Algorithm for Real Time Embedded Systems

In this paper, we propose a fault-tolerant scheduling for realtime embedded systems. Our scheduling algorithm is dedicated to multibus heterogeneous architectures, which take as input a given system description and a given fault hypothesis. It is based on a data fragmentation and passive redundancy, which allow fast fault detection/retransmission and efficient use of buses. Our scheduling approach consist of a list scheduling heuristic based on a Global System Failure Rate (GSFR). In order to maximize the reliability of the system, the size of each fragmented data depends on GSFR and the bus failure rates. variable fragment size allows reliable communication and to maximize the reliability of the system. Finally, simulation results show the performance of our approach when using data fragmentation with a variable fragment size.